The First and Second Max-SAT Evaluations

نویسندگان

  • Josep Argelich
  • Chu Min Li
  • Felip Manyà
  • Jordi Planes
چکیده

We describe the organization and report on the results of the First and Second Max-SAT Evaluations, which were organized as affiliated events of the 2006 and 2007 editions of the International Conference on Theory and Applications of Satisfiability Testing (SAT-2006 and SAT-2007), discuss the insights gained and point out new directions for forthcoming evaluations. The main objectives of both evaluations were assessing the advancements in the field of Max-SAT solvers through a comparison of their performances, identifying successful solving techniques and encouraging researchers to develop new ones, and creating a publicly available collection of challenging Max-SAT benchmarks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Guest Editors Conclusion

This special issue comprises six papers devoted to SAT solving and three papers devoted to MAXSAT solving. With two exception, the papers contain detailed information about some of the best solvers from the 5th SAT solver competition and from the 2nd MAX-SAT solver competition, which took place as side event of the 10th International Conference on Theory and Applications of Satisfiability Testi...

متن کامل

2006 and 2007 Max-SAT Evaluations: Contributed Instances

In this technical report we briefly describe the instances submitted to the 2006 and 2007 Max-SAT Evaluations. First, we introduce the instances that can be directly encoded as Max-SAT. Then, we describe the methods used to translate problem instances coming from other optimization frameworks to Max-SAT. Finally, we present a quick reference table containing short descriptions of each set of pr...

متن کامل

Read-Once Resolution for Unsatisfiability-Based Max-SAT Algorithms

This paper proposes the integration of the resolution rule for Max-SAT with unsatisfiability-based Max-SAT solvers. First, we show that the resolution rule for Max-SAT can be safely applied as dictated by the resolution proof associated with an unsatisfiable core when such proof is read-once, that is, each clause is used at most once in the resolution process. Second, we study how this property...

متن کامل

QMaxSAT: A Partial Max-SAT Solver

We present a partial Max-SAT solver QMaxSAT which uses CNF encoding of Boolean cardinality constraints. The old version 0.1 was obtained by adapting a CDCL based SAT solver MiniSat to manage cardinality constraints. It was placed first in the industrial subcategory and second in the crafted subcategory of partial Max-SAT category of the 2010 Max-SAT Evaluation. The new version 0.2 is obtained b...

متن کامل

Inference Rules for High-Order Consistency in Weighted CSP

Recently defined resolution calculi for Max-SAT and signed Max-SAT have provided a logical characterization of the solving techniques applied by Max-SAT and WCSP solvers. In this paper we first define a new resolution rule, called signed Max-SAT parallel resolution, and prove that it is sound and complete for signed Max-SAT. Second, we define a restriction and a generalization of the previous r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JSAT

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2008